A multiagent-based hexagon shape approach for shortest path computation in wireless sensors network
نویسندگان
چکیده
منابع مشابه
A neural network for shortest path computation
This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations ...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملEnhanced Shortest Path Computation for Multiagent-based Intermodal Transport Planning in Dynamic Environments
This paper addresses improved urban mobility using multiagent simulation. We provide a description of the agent model and the routing infrastructure as a step towards a rich model of the interactions that happen in intermodal transport planning tasks. The multiagent model is generic in the sense that different public and individual transport agents and transportation agencies can be added and p...
متن کاملA Modified Pulse Coupled Neural Network for Shortest Path Computation
Shortest path computation is a classical combinatorial optimization problem. Neural networks, as a class of effective optimization approaches, have been used for processing path optimization problems for a long time. Pulse Coupled Neural Network (PCNN) is a very different neural network, which has also been proposed to compute shortest paths in recent years. In some existing PCNN models, the co...
متن کاملFPGA-based Acceleration of Shortest Path Computation
There exist several practical applications that require high-speed shortest path computations. In many situations, especially in embedded applications, an FPGA-based accelerator for computing the shortest paths can help to achieve high performance at low cost. This paper presents an FPGA-based distributed architecture for solving the single-source shortest path problem in a fast and efficient m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors International
سال: 2020
ISSN: 2666-3511
DOI: 10.1016/j.sintl.2020.100056